Approximating Minimum-Cost Connected T-Joins
نویسندگان
چکیده
منابع مشابه
Approximating Minimum Cost Steiner Forests
We consider the k-Directed Steiner Forest (k-DSF) problem: given a directed graph G = (V, E) with edge costs, a collection D ⊆ V × V of ordered node pairs, and an integer k ≤ |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs (s, t) ∈ D. When k = |D|, we get the Directed Steiner Forest (DSF) problem. The best known approximation ratios for these problems ar...
متن کاملApproximating minimum cost connectivity problems
We survey approximation algorithms and hardness results for versions of the Generalized Steiner Network (GSN) problem in which we seek to find a low cost subgraph (where the cost of a subgraph is the sum of the costs of its edges) that satisfies prescribed connectivity requirements. These problems include the following well known problems: min-cost k-flow, min-cost spanning tree, traveling sale...
متن کاملApproximation algorithms for minimum-cost k-(S, T ) connected digraphs
We introduce a model for NP-hard problems pertaining to the connectivity of graphs, and design approximation algorithms for some of the key problems in this model. One of the well-known NP-hard problems is to find a minimum-cost strongly connected spanning subgraph of a directed network. In the minimum-cost k-(S, T ) connected digraph (abbreviated, k-(S, T ) connectivity) problem we are given a...
متن کاملMinimum $T$-Joins and Signed-Circuit Covering
Let G be a graph and T be a vertex subset of G with even cardinality. A T -join of G is a subset J of edges such that a vertex of G is incident with an odd number of edges in J if and only if the vertex belongs to T . Minimum T -joins have many applications in combinatorial optimizations. In this paper, we show that a minimum T -join of a connected graph G has at most |E(G)| − 1 2 |E( Ĝ )| edge...
متن کاملApproximating Minimum Cost Connectivity Orientation and Augmentation
Connectivity augmentation and orientation are two fundamental classes of problems related to graph connectivity. The former includes minimum cost spanning trees, k-edge-connected subgraph and more generally, survivable network design problems [9]. In the orientation problems the goal is to find orientations of an undirected graph that achieve prescribed connectivity properties such as global an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9850-8